The existential fragment of S1S over element and successor is the co-Buchi languages

نویسنده

  • Egor Ianovski
چکیده

Büchi’s theorem, in establishing the equivalence between languages definable in S1S over pP,ăq and the ω-regular languages also demonstrated that S1S over pP,ăq is no more expressive than its existential fragment. It is also easy to see that S1S over pP,ăq is equi-expressive with S1S over pP, sq. However, it is not immediately obvious whether it is possible to adapt Büchi’s argument to establish equivalence between expressivity in S1S over pP, sq and its existential fragment. In this paper we show that it is not: the existential fragment of S1S over pP, sq is strictly less expressive, and is in fact equivalent to the co-Büchi languages. 1 Preliminaries 1.1 Second order theory of one successor Definition 1 (S1S syntax). We introduce the following components: • A set of first order variables, denoted by lower case letters, possibly with subscripts. • A set of second order variables, denoted by upper case letters, possibly with subscripts. S1SpP,ăq has the following set of well formed formulae: φ ::“ t ă t | t P X | φ^ φ | φ | Dxiφ | DXiφ. t is understood to range over terms, which in this case are just the first order variables, and X to range over second order variables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Systolic Tree ! - Languages : The Operational andthe Logical

The class of !-languages recognized by systolic (binary) tree automata is introduced. That class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized in terms of a (suitable) concatenation of ((nitary) systolic tree languages. A generalization of ...

متن کامل

The expressive power of existential rst order sentences of B uchi ' s sequential calculus

The aim of this paper is to study the rst order theory of the successor, interpreted on nite words. More speci cally, we complete the study of the hierarchy based on quanti er alternations (or n-hierarchy). It was known (Thomas, 1982) that this hierarchy collapses at level 2, but the expressive power of the lower levels was not characterized e ectively. We give a semigroup theoretic description...

متن کامل

Inference of !-languages from pre$xes

B+ uchi automata are used to recognize languages of in$nite strings. Such languages have been introduced to describe the behavior of real-time systems or in$nite games. The question of inferring them from in$nite examples has already been studied, but it may seem more reasonable to believe that the data from which we want to learn is a set of $nite strings, namely the pre$xes of accepted or rej...

متن کامل

The Theory of Computability Developed in Terms of Satisfaction

The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to 0, individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.

متن کامل

A Logical Characterization of Systolic Languages

In this paper we study, in the framework of mathematical logic, L(SBTA) i.e. the class of languages accepted by Systolic Binary Tree Automata. We set a correspondence (in the style of B uchi Theorem for regular languages) between L(SBTA) and MSOSig], i.e. a decid-able Monadic Second Order logic over a suitable innnite signature Sig. We also introduce a natural subclass of L(SBTA) which still pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1401.4932  شماره 

صفحات  -

تاریخ انتشار 2014